Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix
Let A be a tridiagonal matrix of order n. We show that it is possible to compute and hence condo (A), in O(n) operations. Several algorithms which perform this task are given and their numerical properties are investigated. If A is also positive definite then I[A-[[o can be computed as the norm of the solution to a positive definite tridiagonal linear system whose coeffcient matrix is closely r...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملComputing the Condition Number of Tridiagonal and Diagonal-Plus-Semiseparable Matrices in Linear Time
For an n × n tridiagonal matrix we exploit the structure of its QR factorization to devise two new algorithms for computing the 1-norm condition number in O(n) operations. The algorithms avoid underflow and overflow, and are simpler than existing algorithms since tests are not required for degenerate cases. An error analysis of the first algorithm is given, while the second algorithm is shown t...
متن کاملefficient data mining with evolutionary algorithms for cloud computing application
with the rapid development of the internet, the amount of information and data which are produced, are extremely massive. hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. data mining can overcome this problem. while data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. as the speed of ...
متن کاملEfficient tridiagonal preconditioner for the matrix-free truncated Newton method
In this paper, we study an efficient tridiagonal preconditioner, based on numerical differentiation, applied to the matrix-free truncated Newton method for unconstrained optimization. It is proved that this preconditioner is positive definite for many practical problems. The efficiency of the resulting matrix-free truncated Newton method is demonstrated by results of extensive numerical experim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific and Statistical Computing
سال: 1986
ISSN: 0196-5204,2168-3417
DOI: 10.1137/0907011